A maj Statistic for Set Partitions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A maj Statistic for Set Partitions

We propose a weighting of set partitions which is analogous to the major index for permutations. The corresponding weight generating function yields the q-Stirling numbers of the second kind of Carlitz and Gould. Other interpretations of maj are given in terms of restricted growth functions, rook placements and reduced matrices. The Foata bijection interchanging inv and maj for permutations als...

متن کامل

A Spatial Scan Statistic for Stochastic Scan Partitions

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

A Gray Code for Set Partitions

We consider here the collection of all partitions of an n-set, for fixed n, and we ask: is it possible to arrange these partitions in a list (Gray Code) so that each partition is obtained from its immediate predecessor by changing the class of exactly one element? The answer is affirmative, and we give descriptions of two algorithms which implement the method, the first recursive, the second no...

متن کامل

A Multi-set Identity for Partitions

Amitai REGEV 1 and Doron ZEILBERGER Added Sept. 22, 2009 Guo-Niu Han kindly pointed out to us (something that we should have noticed ourselves if we would have been in the habit of reading carefully all the papers that we cite), that our main result is contained in [B.H.]. Introduction Given an integer-partition λ ` n and a box (a cell) v = [i, j] ∈ λ it determines the arm length av (= λi − j),...

متن کامل

Set Partitions in R

This short paper introduces a code snippet in the form of an R function that enumerates all possible partitions of a finite set given the sizes of the equivalence classes. Three combinatorial problems are solved using the software: one from bioinformatics, one from scheduling theory, and one from forensic science.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1991

ISSN: 0195-6698

DOI: 10.1016/s0195-6698(13)80009-1